Latent structure blockmodels for Bayesian spectral graph clustering
نویسندگان
چکیده
Abstract Spectral embedding of network adjacency matrices often produces node representations living approximately around low-dimensional submanifold structures. In particular, hidden substructure is expected to arise when the graph generated from a latent position model. Furthermore, presence communities within might generate community-specific structures in embedding, but this not explicitly accounted for most statistical models networks. article, class called structure block (LSBM) proposed address such scenarios, allowing clustering one-dimensional manifold present. LSBMs focus on specific space model, random dot product (RDPG), and assign positions each community. A Bayesian model embeddings arising discussed, shown have good performance simulated real-world data. The able correctly recover underlying manifold, even parametric form curves unknown, achieving remarkable results variety real
منابع مشابه
Bayesian Methods for Graph Clustering
Networks are used in many scientific fields such as biology, social science, and information technology. They aim at modelling, with edges, the way objects of interest, represented by vertices, are related to each other. Looking for clusters of vertices, also called communities or modules, has appeared to be a powerful approach for capturing the underlying structure of a network. In this contex...
متن کاملSpectral Graph Clustering
Spectral clustering is a powerful technique in data analysis that has found increasing support and application in many areas. This report is geared to give an introduction to its methods, presenting the most common algorithms, discussing advantages and disadvantages of each, rather than endorsing one of them as the best, because, arguably, there is no black-box algorithm, which performs equally...
متن کاملBayesian latent topic clustering model
Document modeling is important for document retrieval and categorization. The probabilistic latent semantic analysis (PLSA) and latent Dirichlet allocation (LDA) are popular paradigms of document models where word/document correlations are inferred by latent topics. In PLSA and LDA, the unseen words and documents are not explicitly represented at the same time. Model generalization is constrain...
متن کاملLatent Dirichlet Bayesian Co-Clustering
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each row and column of the data matrix to one cluster. Recently a Bayesian co-clustering approach has been proposed which allows a probability distribution membership in row and column clusters. The approach uses variatio...
متن کاملEfficient eigen-updating for spectral graph clustering
Partitioning a graph into groups of vertices such that those within each group are more densely connected than vertices assigned to different groups, known as graph clustering, is often used to gain insight into the organisation of large scale networks and for visualisation purposes. Whereas a large number of dedicated techniques have been recently proposed for static graphs, the design of onli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Computing
سال: 2022
ISSN: ['0960-3174', '1573-1375']
DOI: https://doi.org/10.1007/s11222-022-10082-6